A Sharp Analysis of the Mixing Time for Random Walk on Rooted Trees
نویسنده
چکیده
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n steps are necessary and suffice for convergence to the stationary distribution.
منابع مشابه
Mixing Time for a Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملGetting Lost Efficiently
We consider the mixing time of random walks on a graph G, using the eigenvalue gap to measure the mixing time. We attempt to bound the mixing time in terms of the diameter Diam of G. We show that, for the standard random walk, there exists a family of graphs with diameter 3 but mixing time Ω(n), and a family of trees with diameter 3 but mixing time Ω(n). The main result is a scheme for re-weigh...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملRandom Walk on Uppertriangular Matrices Mixes
We present an upper bound O(n 2) for the mixing time of a simple random walk on upper triangular matrices. We show that this bound is sharp up to a constant, and nd tight bounds on the eigenvalue gap. We conclude by applying our results to indicate that the asymmetric exclusion process on a circle indeed mixes more rapidly than the corresponding symmetric process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009